Approximation of some NP-hard optimization problems by finite machines, in probability
نویسندگان
چکیده
منابع مشابه
Approximation of some NP-hard optimization problems by finite machines, in probability
We introduce a subclass of NP optimization problems which contains some NP-hard problems, e.g., bin covering and bin packing. For each problem in this subclass we prove that with probability tending to 1 (exponentially fast as the number of input items tends to in)nity), the problem is approximable up to any chosen relative error bound ¿ 0 by a deterministic )nite-state machine. More precisely,...
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملApproximation schemes for NP-hard geometric optimization problems: a survey
NP-hard geometric optimization problems arise in many disciplines. Perhaps the most famous one is the traveling salesman problem (TSP): given n nodes in<2 (more generally, in<d), find the minimum length path that visits each node exactly once. If distance is computed using the Euclidean norm (distance between nodes (x1, y1) and (x2, y2) is ((x1−x2)+(y1−y2))) then the problem is called Euclidean...
متن کاملSpeeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
We give faster approximation algorithms for the generalization of two NP-hard spanning tree problems. First, we investigate the problem of minimizing the degree of minimum spanning forests. Fischer [4] has shown how to compute a minimum spanning tree of degree at most b · ∆ + dlogb ne in time O(n 4+1/ ln ) for any b > 1, where ∆ is the value of an optimal solution. We model our generalization a...
متن کاملTypical Performance of Approximation Algorithms for NP-hard Problems
Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with the presentation of a theoretical framework. Herein, three approximation algorithms are examined: linearprogramming relaxation, loopy-belief propagation, and a leaf-removal algorithm. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00016-5